Search results for "target tracking"
showing 3 items of 3 documents
Automatic Acoustic Target Detecting and Tracking on the Azimuth Recording Diagram with Image Processing Methods
2019
International audience; Passive acoustic target detection has been a hot research topic for a few decades. Azimuth recording diagram is one of the most promising techniques to estimate the arrival direction of the interested signal by visualizing the sound wave information. However, this method is challenged by the random ambient noise, resulting in low reliability and short effective distance. This paper presents a real-time postprocessing framework for passive acoustic target detection modalities by using a sonar array, in which image processing methods are used to automate the target detecting and tracking on the azimuth recording diagram. The simulation results demonstrate that the prop…
Peak Power Demand and Energy Consumption Reduction Strategies for Trains under Moving Block Signalling System
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/940936 Open Access In the moving block signalling (MBS) system where the tracking target point of the following train is moving forward with its leading train, overload of the substations occurs when a dense queue of trains starts (or restarts) in very close distance interval. This is the peak power demand problem. Several methods have been attempted in the literature to deal with this problem through changing train's operation strategies. However, most existing approaches reduce the service quality. In this paper, two novel approaches - …
Greedy and K-Greedy algoritmhs for multidimensional data association
2011
[EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ is to match groups of $d$ objects in such a way that each measurement is associated with at most one track and each track is associated with at most one measurement from each list, optimizing a certain objective function. It is well known that the MDA problem is NP-hard for $d\geq3$. In this paper five new polynomial time heuristics to solve the MDA problem arising in MTT are presented. They are all based on the semi-greedy approach introduced in earlier research. Experimen…